A Decidable Temporal Logic for Temporal Prepositions
نویسنده
چکیده
This paper investigates the connection between temporal logic and the semantics of some temporal expressions in English. Specii-cally, we show how the meanings of English temporal preposition-phrases can be expressed as modal operators in an interval-based temporal logic which we call ETL0. We show how cascaded temporal preposition phrases and temporal preposition phrases with complex complements can be translated into ETL0. Finally, we present a decision-procedure for ETL0 and establish its correctness. The main contribution of the paper is to provide a characterization, in terms familiar to modal logicians, of the expressive resources made available by an important class of temporal expressions in English.
منابع مشابه
Investigating the Use of Games and Flash Cards in Teaching Spatial and Temporal Prepositions to Iranian Pre-Intermediate EFL Learners
One of the most problematic areas for teachers and learners in English classrooms is prepositions. Two types of prepositions in English are spatial (space) and temporal (time) prepositions. Prepositions are words linking two entities and thereby specifying the relation of the two. The main purpose of this study was to investigate the role of games and flash cards in learning place and time prep...
متن کاملTemporal Prepositions and Their Logic
This paper investigates the computational complexity of reasoning with English sentences featuring temporal prepositions, temporal subordinating conjunctions and the order-denoting adjectives ‘first’ and ‘last’. A fragment of English featuring these constructions, called TPE, is defined by means of a context-free grammar. The phrasestructures which this grammar assigns to the sentences it recog...
متن کاملSafety Metric Temporal Logic Is Fully Decidable
Metric Temporal Logic (MTL) is a widely-studied real-time extension of Linear Temporal Logic. In this paper we consider a fragment of MTL, called Safety MTL, capable of expressing properties such as invariance and time-bounded response. Our main result is that the satisfiability problem for Safety MTL is decidable. This is the first positive decidability result for MTL over timed ω-words that d...
متن کاملFixpoint Extensions of Temporal Description Logics
In this paper we introduce a decidable fixpoint extension of temporal Description Logics. We exploit the decidability results obtained for various monodic extensions of Description Logics to obtain decidability and tight complexity results for temporal fixpoint extensions of these Description Logics and more generally for the decidable monodic fragments of first order logic.
متن کاملRealizability of Real-Time Logics
We study the realizability problem for specifications of reactive systems expressed in real-time linear temporal logics. The logics we consider are subsets of MITL (Metric Interval Temporal Logic), a logic for which the satisfiability and validity problems are decidable, a necessary condition for the realizability problem to be decidable. On the positive side, we show that the realizability of ...
متن کامل